Self-evolving Ant Colony Optimization and Its Application to Traveling Salesman Problem
نویسندگان
چکیده
Ant colony optimization (ACO) algorithms are a recently developed, population-based approach which has been successfully applied to combinatorial optimization problems. However, in the ACO algorithms, it is difficult to adjust the balance between intensification and diversification and thus the performance is not always very well. In this paper we proposed an improved ACO algorithm in which a self-evolving strategy is adopted so as to acquire a trade-off between intensification and diversification. With this strategy we make each ant evolve by means of multiple pheromone deposition, the total concentration of which includes two parts, that is, one part is deposited by several best ants of the last iteration and the ant that has searched the global-best solution by the current iteration, and the other part is deposited temporarily by each ant itself of the last iteration as well. The proposed algorithm is tested by simulating Traveling Salesman Problem (TSP) and experimental results show that Self-evolving Ant Colony Optimization has superior performance when compared with other existing ACO algorithms.
منابع مشابه
A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملAnt Colony Optimization with Memory and Its Application to Traveling Salesman Problem
proposed to improve the performance of the ACO algorithm. In this paper an ant colony optimization with memory is proposed, which is applied to the classical traveling salesman problem (TSP). In the proposed algorithm, each ant searches the solution not only according to the pheromone and heuristic information but also based on the memory which is from the solution of the last iteration. A larg...
متن کاملSelf - adaptive Ant Colony Algorithm for Real Estate Portfolio Optimization based on Information
To find out an effective way to solve the real estate portfolio optimization, an improved Ant Colony Algorithm based on information entropy was proposed. The information entropy was used to control the path selection and evolutional strategy by self-adjusting to overcome the premature convergence problem of the basic Ant Colony Algorithm. Simulation study on Traveling Salesman Problem and the a...
متن کاملAnt Colony Optimization for dynamic Traveling Salesman Problems
This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live in colonies able to solve complex problems. The intelligence of the global society arises from self organization mechanisms, based on the indirect communication between individuals through pheromones. The routing problem...
متن کاملEvolving Ant Colony Optimization
Ant Colony Optimization (ACO) is a promising new approach to combinatorial optimization. Here ACO is applied to the traveling salesman problem (TSP). Using a genetic algorithm (GA) to nd the best set of parameters, we demonstrate the good performance of ACO in nding good solutions
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012